The Edit Distance Function and Symmetrization
نویسندگان
چکیده
منابع مشابه
The Edit Distance Function and Symmetrization
The edit distance between two graphs on the same labeled vertex set is the size of the symmetric difference of the edge sets. The distance between a graph, G, and a hereditary property, H, is the minimum of the distance between G and each G′ ∈ H with the same number of vertices. The edit distance function of H is a function of p ∈ [0, 1] and is the limit of the maximum normalized distance betwe...
متن کاملThe edit distance function and localization
The edit distance between two graphs on the same labeled vertex set is the symmetric difference of the edge sets. The distance between a graph, G, and a hereditary property, H, is the minimum of the distance between G and each G′ ∈ H. The edit distance function of H is a function of p ∈ [0, 1] and is the limit of the maximum normalized distance between a graph of density p and H. This paper dev...
متن کاملMap Edit Distance vs. Graph Edit Distance for Matching Images
Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another...
متن کاملTree Edit Distance, Alignment Distance and Inclusion
We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting and relabeling nodes. These operations lead to the tree edit distance, alignment distance and inclusion problem. For each problem we review the results available and present, in detail, one or more of the central algorithms for solving the problem.
متن کاملMulticolor and Directed Edit Distance
The editing of a combinatorial object is the alteration of some of its elements such that the resulting object satisfies a certain fixed property. The edit problem for graphs, when the edges are added or deleted, was first studied independently by the authors and Kézdy [J. Graph Theory (2008) 58(2), 123–138] and by Alon and Stav [Random Structures Algorithms (2008) 33(1), 87–104]. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/2262